GELFAND–DICKEY ALGEBRA AND HIGHER SPIN SYMMETRIES ON T2 = S1 × S1
نویسندگان
چکیده
منابع مشابه
Applications of Degree for S1-equivariant Gradient Maps to Variational Nonlinear Problems with S1-symmetries S
There are developed many topological methods which are powerful tools in the theory of critical points of functionals; see for example [2], [3], [5], [6], [9], [13]–[20], [22]–[25], [27]–[29], [32], [33], [43]–[45], [47], [48], [51], [59]. It happens quite often that functionals whose critical points are important in the theory of differential equations are invariant under an action of a compac...
متن کاملNotes on Higher Spin Symmetries
The strong form of the AdS/CFT correspondence implies that the leading N expressions for the connected correlation functions of the gauge invariant operators in the free N = 4 supersymmetric Yang-Mills theory with the gauge group SU(N) correspond to the boundary S matrix of the classical interacting theory in the Anti de Sitter space. It was conjectured recently that the theory in the bulk shou...
متن کاملChromatic Calculations for the S1 × S1 Transfer
where on the left hand side the coefficient of XrY s is βrβs. If n is a natural number then β(X) = β([n]X), where [n]X = [n]F X is the n-series. We alse have β(X)−1 = β([−1]X), where F ([−1]X,X) = 0 = F (X, [−1]X). In fact, for any non-zero q ∈ Z(p), we can make sense of [q]X and β(X) = β([q]X). Now recall the Araki and Hazewinkel generators vn, wn ∈ BP2pn−2 for which v0 = w0 = p and vn ≡ wn mo...
متن کاملBinding of S1(A1) and S1(A2) to F-actin.
The binding curve of myosin subfragment-1 (S1) to F-actin is not a simple hyperbola: at high concentrations of S1 the binding curve can be transformed into a linear plot ("normal" binding), but at small concentrations of S1 the binding complications deform the binding curve and produce nonlinear transforms ("anomalous" binding) [Andreev, O. A., & Borejdo, J. (1992) J. Muscle Res. Cell Motil. 13...
متن کاملAppendix S1
Here we briefly review our information theoretic approach to revealing community structure in weighted and directed networks [1] and present a new fast stochastic and recursive search algorithm to minimize the map equation — the objective function of our method. We have developed this algorithm to be able to accurately partition the large number of bootstrap networks [2]. The search algorithm c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics A
سال: 2008
ISSN: 0217-751X,1793-656X
DOI: 10.1142/s0217751x08041505